A communication-computation efficient group key algorithm for large and dynamic groups
نویسندگان
چکیده
The management of secure communication among groups of participants requires a set of secure and efficient operations. In this paper we extend existing work to present a Communication–Computation Efficient Group Key Algorithm (CCEGK) designed to provide both efficient communication and computation, addressing performance, security and authentication issues of CCEGK. Additionally, we compare CCEGK with three other leading group key algorithms, EGK, TGDH, and STR. An analytical comparison of all algorithms revealed eight similar methods: add, remove, merge, split, mass add, mass remove, initialize, and key refresh. Comparing the cost in terms of communication and computation, we found CCEGK to be more efficient across the board. 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Efficient Solution to Password-based Key Exchange for Large Groups
This paper presents an efficient solution to key exchange problem for large groups in the password-based scenario. Our scheme can combine existing group protocols to get a hybrid group key exchange protocol which is efficient in terms of both computation and communication. And the resulting protocol allows users to securely join and leave the group at any time—the so-called dynamic case. For dy...
متن کاملDynamic Group Key Distribution Using MDS Codes
Efficient key distribution is an important problem for secure group communications. In this paper, we present a new group key distribution scheme that supports dynamic multicast group membership changes. Instead of using encryption algorithms, the scheme employs MDS codes, a class of error control codes. The scheme achieves both forward and backward secrecy of sessions using freshly generated r...
متن کاملKey Agreement in Dynamic Peer Groups
ÐAs a result of the increased popularity of group-oriented applications and protocols, group communication occurs in many different settings: from network multicasting to application layer teleand videoconferencing. Regardless of the application environment, security services are necessary to provide communication privacy and integrity. This paper considers the problem of key agreement in dynam...
متن کاملAn Efficient Tree-Based Group Key Agreement Using Bilinear Map
Secure and reliable group communication is an increasingly active research area by growing popularity in group-oriented and collaborative application. One of the important challenges is to design secure and efficient group key management. While centralized management is often appropriate for key distribution in large multicast-style groups, many collaborative group settings require distributed ...
متن کاملDistributed Collaborative Key Agreement Protocols for Dynamic Peer Groups
We consider several distributed collaborative key agreement protocols for dynamic peer groups. This problem has several important characteristics which make it different from traditional secure group communication. They are (1) distributed nature in which there is no centralized key server, (2) collaborative nature in which the group key is contributory; i.e., each group member will collaborati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Networks
دوره 51 شماره
صفحات -
تاریخ انتشار 2007